We report the results of a computer enumeration that found that there are 3155 perfect 1-factorisations (P1Fs) of the complete graph K16. Of these, 89 have a nontrivial automorphism group (correcting an earlier claim of 88 by Meszka and Rosa ['Perfect 1-factorisations of K16 with nontrivial automorphism group', J. Combin. Math. Combin. Comput. 47 (2003), 97-111]). We also (i) describe a new invariant which distinguishes between the P1Fs of K16, (ii) observe that the new P1Fs produce no atomic Latin squares of order 15 and (iii) record P1Fs for a number of large orders that exceed prime powers by one.</p
Abstract — The existence of a perfect 1-factorization of the complete graph Kn, for arbitrary n, is ...
AbstractWe give a characterization of the structure of the symmetry groups of perfect 1-factorizatio...
AbstractThe following problem has arisen in the study of graphs, lattices and finite topologies. Is ...
A perfect 1-factorisation of a graph G is a decomposition of G into edge disjoint 1-factors such tha...
AbstractA perfect 1-factorisation of a graph G is a decomposition of G into edge disjoint 1-factors ...
AbstractWe construct perfect 1-factorization of K1332 and K6860 which are newly obtained
We consider one-factorizations of K_2n possessing an automorphism group acting regularly (sharply ...
Abstract: A 1-factorization of a graph is a decomposition of the graph into edge disjoint perfect ma...
A 1-factorization of a graph is a decomposition of the graph into edge disjoint perfect matchings. T...
A defining set of a 1-factorization of a graph G is a set of partial 1-factors of G which may be com...
A 1-factor in an n-vertex graph G is a collection of n/2 vertex-disjoint edges and a 1-factorization...
It is shown that a 1-factorization of Kn with a doubly transitive automorphism group on vertices is ...
A 1-factorisation of a graph is perfect if the union of any two of its 1-factors is a Hamiltonian cy...
AbstractA 1-factorisation of a graph is perfect if the union of any two of its 1-factors is a Hamilt...
A survey on the state of art on the problem of constructing one-factorizations of complete graph whi...
Abstract — The existence of a perfect 1-factorization of the complete graph Kn, for arbitrary n, is ...
AbstractWe give a characterization of the structure of the symmetry groups of perfect 1-factorizatio...
AbstractThe following problem has arisen in the study of graphs, lattices and finite topologies. Is ...
A perfect 1-factorisation of a graph G is a decomposition of G into edge disjoint 1-factors such tha...
AbstractA perfect 1-factorisation of a graph G is a decomposition of G into edge disjoint 1-factors ...
AbstractWe construct perfect 1-factorization of K1332 and K6860 which are newly obtained
We consider one-factorizations of K_2n possessing an automorphism group acting regularly (sharply ...
Abstract: A 1-factorization of a graph is a decomposition of the graph into edge disjoint perfect ma...
A 1-factorization of a graph is a decomposition of the graph into edge disjoint perfect matchings. T...
A defining set of a 1-factorization of a graph G is a set of partial 1-factors of G which may be com...
A 1-factor in an n-vertex graph G is a collection of n/2 vertex-disjoint edges and a 1-factorization...
It is shown that a 1-factorization of Kn with a doubly transitive automorphism group on vertices is ...
A 1-factorisation of a graph is perfect if the union of any two of its 1-factors is a Hamiltonian cy...
AbstractA 1-factorisation of a graph is perfect if the union of any two of its 1-factors is a Hamilt...
A survey on the state of art on the problem of constructing one-factorizations of complete graph whi...
Abstract — The existence of a perfect 1-factorization of the complete graph Kn, for arbitrary n, is ...
AbstractWe give a characterization of the structure of the symmetry groups of perfect 1-factorizatio...
AbstractThe following problem has arisen in the study of graphs, lattices and finite topologies. Is ...